Krlpke Models and Intermediate Logics
نویسنده
چکیده
In [10], Kripke gave a definition of the semantics of the intuitionistic logic. Fitting [2] showed that Kripke's models are equivalent to algebraic models (i.e., pseudo-Boolean models) in a certain sense. As a corollary of this result, we can show that any partially ordered set is regarded as a (characteristic) model of a intermediate logic ̂ We shall study the relations between intermediate logics and partially ordered sets as models of them, in this paper. We call a partially ordered set, a Kripke model.^ At present we don't know whether any intermediate logic 'has a Kripke model. But Kripke models have some interesting properties and are useful when we study the models of intermediate logics. In §2, we shall study general properties of Kripke models. In §3, we shall define the height of a Kripke model and show the close connection between the height and the slice, which is introduced in [7]. In §4, we shall give a model of LP» which is the least element in n-ih slice Sn (see [7]).
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملHypersequent Calculi for some Intermediate Logics with Bounded Kripke Models
In this paper we define cut-free hypersequent calculi for some intermediate logics semantically characterized by bounded Kripke models. In particular we consider the logics characterized by Kripke models of bounded width Bwk, by Kripke models of bounded cardinality Bck and by linearly ordered Kripke models of bounded cardinality Gk. The latter family of logics coincides with finite-valued Gödel...
متن کاملApplications of Intuitionistic Logic in Answer Set Programming
We present some applications of intermediate logics in the field of Answer Set Programming (ASP). A brief, but comprehensive introduction to the answer set semantics, intuitionistic and other intermediate logics is given. Some equivalence notions and their applications are discussed. Some results on intermediate logics are shown, and applied later to prove properties of answer sets. A character...
متن کاملSpace-efficient Decision Procedures for Three Interpolable Propositional Intermediate Logics
In this paper we present duplication-free tableau calculi for three propositional intermediate interpolable logics, namely the logic characterized by rooted Kripke models with depth two at most, the logic characterized by rooted Kripke models with two final elements at most and depth two at most and the logic characterized by rooted Kripke models with a final element at most (also known as Jank...
متن کاملCdmtcs Research Report Series Computable Kripke Models and Intermediate Logics
We introduce e ectiveness considerations into model theory of intuitionistic logic. We investigate e ectiveness of completeness (by Kripke) results for intermediate logics such as for example, intuitionistic logic, classical logic, constant domain logic, directed frames logic, Dummett's logic, etc.
متن کامل